Non-convex polyhedral volume of interest selection
نویسندگان
چکیده
We introduce a novel approach to specify and edit volumes of interest (VOI for short) interactively. Enhancing the capabilities of standard systems we provide tools to edit the VOI by defining a not necessarily convex polyhedral bounding object. We suggest to use low-level editing interactions for moving, inserting and deleting vertices, edges and faces of the polyhedron. The low-level operations can be used as building blocks for more complex higher order operations fitting the application demands. Flexible initialization allows the user to select within a few clicks convex VOI that in the classical clipping plane model need the specification of a large number of cutting planes. In our model it is similarly simple to select non-convex VOI. Boolean combinations allow to select non-connected VOI of arbitrary complexity. The polyhedral VOI selection technique enables the user to define VOI with complex boundary structure interactively, in an easy to comprehend and predictable manner.
منابع مشابه
Automatic Convexification of Space using BSP-trees
Convex representations of shapes have several nice properties that can be exploited to generate efficient geometric algorithms. At the same time, extending algorithms from convex to non-convex shapes is non-trivial and often leads to more expensive solutions. An alternative and sometimes more efficient solution is to transform the non-convex problem into a collection of convex problems using a ...
متن کاملInflating polyhedral surfaces
Can you have a non-convex polyhedron with a bigger volume than a convex polyhedron with the isometric surface? Imagine you start blowing air into a polyhedron with a bendable but non-stretchable surface. What can be said about the limiting shape? These are the key questions I will consider. I will start the talk by discussing the history of the problem, presenting examples, and surveying earlie...
متن کاملRobust portfolio selection with polyhedral ambiguous inputs
Ambiguity in the inputs of the models is typical especially in portfolio selection problem where the true distribution of random variables is usually unknown. Here we use robust optimization approach to address the ambiguity in conditional-value-at-risk minimization model. We obtain explicit models of the robust conditional-value-at-risk minimization for polyhedral and correlated polyhedral am...
متن کاملGeometrie Algorithms and Algorithmic Geometry
In this paper I would like to illustrate two facts. First, that ideas borrowed from convex, projective, and other classical branches of geometry play an important role in the design of algorithms for problems that do not seem to have anything to do with geometry: for problems in optimization, combinatorics, algebra, and number theory. Second, that such applications of geometry suggest some very...
متن کاملThe Discrete Duality Finite Volume method for the Stokes equations on 3-D polyhedral meshes
We develop a Discrete Duality Finite Volume (DDFV) method for the three-dimensional steady Stokes problem with a variable viscosity coefficient on polyhedral meshes. Under very general assumptions on the mesh, which may admit non-convex and non-conforming polyhedrons, we prove the stability and well-posedness of the scheme. We also prove the convergence of the numerical approximation to the vel...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Computerized medical imaging and graphics : the official journal of the Computerized Medical Imaging Society
دوره 34 2 شماره
صفحات -
تاریخ انتشار 2010